CLASSIFICATION OF TETRAVALENT -TRANSITIVE NONNORMAL CAYLEY GRAPHS OF FINITE SIMPLE GROUPS
نویسندگان
چکیده
Abstract A graph $\Gamma $ is called $(G, s)$ -arc-transitive if $G \le \text{Aut} (\Gamma )$ transitive on the set of vertices and s -arcs , where for an integer $s \ge 1$ -arc a sequence $s+1$ $(v_0,v_1,\ldots ,v_s)$ such that $v_{i-1}$ $v_i$ are adjacent $1 i s$ $v_{i-1}\ne v_{i+1}$ s-1$ . 2-transitive it $(\text{Aut} ), 2)$ but not 3)$ -arc-transitive. Cayley group G normal in $\text{Aut} nonnormal otherwise. Fang et al. [‘On edge graphs valency four’, European J. Combin. 25 (2004), 1103–1116] proved tetravalent finite simple then either or one groups $\text{PSL}_2(11)$ $\text{M} _{11}$ _{23}$ $A_{11}$ However, was unknown whether when these four groups. We answer this question by proving among only produces connected graphs. prove further there exactly two which nonisomorphic both determined paper. As consequence, automorphism any determined.
منابع مشابه
5-Arc transitive cubic Cayley graphs on finite simple groups
In this paper, we determine all connected 5-arc transitive cubic Cayley graphs on the alternating group A47; there are only two such graphs (up to isomorphism). By earlier work of the authors, these are the only two nonnormal connected cubic arc-transitive Cayley graphs for finite nonbelian simple groups, and so this paper completes the classification of such non-normal Cayley graphs.
متن کاملDistance Transitive Graphs and Finite Simple Groups
This paper represents the first step in the classification of finite primitive distance transitive graphs. In it we reduce the problem to the case where the automorphism group is either almost simple or affine. Let ^ be a simple, connected, undirected graph with vertex set Q. If oc, /? e Q, then d(a, j8) denotes the distance between a and /3 in §. Let G be some group of automorphisms of §. Then...
متن کاملTetravalent edge-transitive Cayley graphs with odd number of vertices
A characterisation is given of edge-transitive Cayley graphs of valency 4 on odd number of vertices. The characterisation is then applied to solve several problems in the area of edge-transitive graphs: answering a question proposed by Xu (1998) regarding normal Cayley graphs; providing a method for constructing edge-transitive graphs of valency 4 with arbitrarily large vertex-stabiliser; const...
متن کاملProduct of normal edge-transitive Cayley graphs
For two normal edge-transitive Cayley graphs on groups H and K which have no common direct factor and $gcd(|H/H^prime|,|Z(K)|)=1=gcd(|K/K^prime|,|Z(H)|)$, we consider four standard products of them and it is proved that only tensor product of factors can be normal edge-transitive.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of The Australian Mathematical Society
سال: 2021
ISSN: ['0004-9727', '1755-1633']
DOI: https://doi.org/10.1017/s0004972720001446